Approximate Analysis of General Priority Queues
نویسنده
چکیده
The present paper deals with the problem of calculating queue length distributions in a priority queueing model with a preemptive-resume policy under the assumption of general arrival and service distributions. The multi-queue priority system is decomposed into single-queue vacation systems, for which the visit and inter-visit distributions are approximated by the idle and busy period of a ΣGI/G/1-queue. These vacation models are analyzed via matrix-analytic techniques. The accuracy of the approximation scheme is verified by means of an extensive simulation study. The developed approximation turns out to be accurate, robust and computationally efficient.
منابع مشابه
A Fast Matrix-analytic Approximation for the Two Class Gi/g/1 Non-preemptive Priority Queue
In this paper we present the approximate waiting time analysis of two class non-preemptive priority queues. The traffics of the queue are characterized by ”two parameter description”, which means that the mean and the squared coefficient of variation of the inter arrival times and of the service times are given. The solution is based on the separate analysis of the low and high priority queue. ...
متن کاملRevisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queue with the highest priority. However, very few articles describing such image analysis algorithms specify which implementation of the priority queue was used. Many assessments of priority queues can be found in the lit...
متن کاملSprayLists: Provably Correct Approximate Priority Queues in a Shared Memory Setting
An important data structure well understood in sequential settings is the priority queue, which supports the following three operations: insert(x), which inserts an item with priority x, delete(x), which deletes the item with priority x, and deleteMin, which deletes and returns the item with lowest priority. Fibonacci heaps [4] support deleteMin and delete in amortized logarithmic time, and ins...
متن کاملA General Technique for Implementation of Efficient Priority Queues
This paper presents a very general technique for the implementation of mergeable priority queues. The amortized running time is O(log n) for DeleteMin and Delete, and (1) for all other standard operations. In particular, the operation DecreaseKey runs in amortized constant time. The worst-case running time is O(log n) or better for all operations. Several examples of mergeable priority queues a...
متن کاملFast Priority Queues for Parallel Branch-and-Bound
Currently used parallel best rst branch-and-bound algorithms either suuer from contention at a centralized priority queue or can only approximate the best rst strategy. Bottleneck free algorithms for parallel priority queues are known but they cannot be implemented very eeciently on contemporary machines. We present quite simple randomized algorithms for parallel priority queues on distributed ...
متن کامل